On covering bridged plane triangulations with balls
نویسندگان
چکیده
We show that every plane graph of diameter 2r in which all inner faces are triangles and all inner vertices have degree larger than 5 can be covered with two balls of radius r : 2003 Wiley Periodicals, Inc. J Graph Theory 44:
منابع مشابه
Delaunay Triangulations on Orientable Surfaces of Low Genus
Earlier work on Delaunay triangulation of point sets on the 2D flat torus, which is locally isometric to the Euclidean plane, was based on lifting the point set to a locally isometric 9-sheeted covering space of the torus [28, 20, 12, 11]. Under mild conditions the Delaunay triangulation of the lifted point set, consisting of 9 copies of the input set, projects to the Delaunay triangulation of ...
متن کاملOn the Numbers of Faces of Low-Dimensional Regular Triangulations and Shellable Balls
We investigate the conjectured sufficiency of a condition for h-vectors (1, h1, h2, . . . , hd, 0) of regular d-dimensional triangulations. (The condition is already shown to be necessary in [2]). We first prove that the condition is sufficient when h1 ≥ h2 ≥ · · · ≥ hd. We then derive some new shellings of squeezed spheres and use them to prove that the condition is sufficient when d = 3. Fina...
متن کاملOn Free Planes in Lattice Ball Packings
This note, by studying relations between the length of the shortest lattice vectors and the covering minima of a lattice, mainly proves that for every d-dimensional packing lattice of balls one can find a 4-dimensional plane, parallel to a lattice plane, such that the plane meets none of the balls of the packing, provided the dimension d is large enough. On the other hand, we show that for cert...
متن کاملGenerating All Triangulations of Plane Graphs
In this paper, we deal with the problem of generating all triangulations of plane graphs. We give an algorithm for generating all triangulations of a triconnected plane graph G of n vertices. Our algorithm establishes a tree structure among the triangulations of G, called the “tree of triangulations,” and generates each triangulation of G in O(1) time. The algorithm uses O(n) space and generate...
متن کاملEfficient Generation of Plane Triangulations without Repetitions
A “based” plane triangulation is a plane triangulation with one designated edge on the outer face. In this paper we give a simple algorithm to generate all biconnected based plane triangulations with at most n vertices. The algorithm uses O(n) space and generates such triangulations in O(1) time per triangulation without duplications. The algorithm does not output entire triangulations but the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 44 شماره
صفحات -
تاریخ انتشار 2003